Adaptively Weighted Audits of Instant-Runoff Voting Elections: AWAIRE
نویسندگان
چکیده
Abstract An election audit is risk-limiting if the limits (to a pre-specified threshold) chance that an erroneous electoral outcome will be certified. Extant methods for auditing instant-runoff voting (IRV) elections are either not or require cast vote records (CVRs), system’s electronic record of votes on each ballot. CVRs always available, instance, in jurisdictions tabulate IRV contests manually. We develop RLA method (AWAIRE) uses adaptively weighted averages test supermartingales to efficiently when available. The adaptive weighting ‘learns’ efficient set hypotheses confirm outcome. When accurate AWAIRE can use them increase efficiency match performance existing CVRs. provide open-source prototype implementation handle with up six candidates. Simulations using data from real show likely practice. discuss how extend computational approach more Adaptively general tool, useful beyond audits collections sequentially while rigorously controlling familywise error rate.
منابع مشابه
Frequency of monotonicity failure under Instant Runoff Voting: estimates based on a spatial model of elections
It has long been recognized that Instant Runoff Voting (IRV) suffers from a defect known as nonmonotonicity, wherein increasing support for a candidate among a subset of voters may adversely affect that candidate’s election outcome. The expected frequency of this type of behavior, however, remains an open and important question, and limited access to detailed election data makes it difficult to...
متن کاملBallot (and voter) “exhaustion” under Instant Runoff Voting: An examination of four ranked-choice elections
Some proponents of municipal election reform advocate for the adoption of Instant Runoff Voting (IRV), a method that allows voters to rank multiple candidates according to their preferences. Although supporters claim that IRV is superior to the traditional primaryrunoff election system, research on IRV is limited. We analyze data taken from images of more than 600,000 ballots cast by voters in ...
متن کاملA Linked-List Approach to Cryptographically Secure Elections Using Instant Runoff Voting
Numerous methods have been proposed to conduct cryptographically secure elections. Most of these protocols focus on 1-out-of-n voting schemes. Few protocols have been devised for preferential voting systems, in which voters provide a list of rankings of the candidates, and many of those treat ballots as if they were ballots in a 1-out-of-n voting scheme. We propose a linked-list-based scheme th...
متن کاملEstimating the Margin of Victory for Instant-Runoff Voting
A general definition is proposed for the margin of victory of an election contest. That definition is applied to Instant Runoff Voting (IRV)1 and several estimates for the IRV margin of victory are described: two upper bounds and two lower bounds. Given round-by-round vote totals, the time complexity for calculating these bounds does not exceed O(C logC), where C is the number of candidates. It...
متن کاملMajority runoff elections: Strategic voting and Duverger's hypothesis
The majority runoff system is widely used around the world, yet our understanding of its properties and of voters’ behavior is limited. In this paper, we fully characterize the set of strictly perfect voting equilibria in large three-candidate majority runoff elections. Considering all possible distributions of preference orderings and intensities, we prove that only two types of equilibria can...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2023
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-031-43756-4_3